A multivariate Gnedenko law of large numbers
نویسندگان
چکیده
منابع مشابه
A Note on the Strong Law of Large Numbers
Petrov (1996) proved the connection between general moment conditions and the applicability of the strong law of large numbers to a sequence of pairwise independent and identically distributed random variables. This note examines this connection to a sequence of pairwise negative quadrant dependent (NQD) and identically distributed random variables. As a consequence of the main theorem ...
متن کاملThe Law of Large Numbers
at the same time, the mean chance of the contrary event F will be the sum of the fractions 1− p1, −− p2, . . . 1− pμ , divided by μ; and by designating it by q′, one will have p′+q′ = 1. This being, the one of the general propositions, which we wish to consider, consists in this that if one calls m and n the numbers of times that E and F will arrive or are arrived during the series of these tri...
متن کاملHyperfinite law of large numbers
The Loeb space construction in nonstandard analysis is applied to the theory of processes to reveal basic phenomena which cannot be treated using classical methods. An asymptotic interpretation of results established here shows that for a triangular array (or a sequence) of random variables, asymptotic uncorrelatedness or asymptotic pairwise independence is necessary and sufficient for the vali...
متن کاملA Dynamical Law of Large Numbers
Abstract. Let X1, X2, . . . denote i.i.d. random bits, each taking the values 1 and 0 with respective probabilities p and 1 − p. A well-known theorem of Erdős and Rényi (1970) describes the length of the longest contiguous stretch, or “run,” of ones in X1, . . . , Xn for large values of n. Benjamini, Häggström, Peres, and Steif (2003, Theorem 1.4) demonstrated the existence of unusual times, pr...
متن کاملA law of large numbers for fuzzy numbers
We study the following problem: If ξ1, ξ2, . . . are fuzzy numbers with modal values M1, M2, . . . , then what is the strongest t-norm for which lim n→∞ Nes ( mn − ≤ ξ1 + · · ·+ ξn n ≤ mn + ) = 1, for any > 0, where mn = M1 + · · ·+Mn n , the arithmetic mean ξ1 + · · ·+ ξn n is defined via sup-t-norm convolution and Nes denotes necessity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2013
ISSN: 0091-1798
DOI: 10.1214/12-aop804